Ordering chemical graphs by Sombor indices and its applications

نویسندگان

چکیده

Topological indices are a class of numerical invariants that predict certain physical and chemical properties molecules. Recently, two novel topological indices, named as Sombor index reduced index, were introduced by Gutman, defined where denotes the degree vertex in . In this paper, our aim is to order trees, unicyclic graphs, bicyclic graphs tricyclic with respect index. We determine first fourteen minimum four three seven graphs. At last, we consider applications octane isomers.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Well-Quasi-Ordering, Overview and its Applications

This talk shows theorems, techniques, and applications of well-quasi-ordering (WQO). First, we introduce what is WQO, and Kruskaltype theorems on various data structures [31, 15, 16, 23, 34, 33]. The basic proof technique, minimal bad sequence (MBS), will be introduced for the simplest case, Higman’s Lemma. Then, WQO will be extended to better-quasi-ordering (BQO) for infinite data structures [...

متن کامل

Hessian Stochastic Ordering in the Family of multivariate Generalized Hyperbolic Distributions and its Applications

In this paper, random vectors following the multivariate generalized hyperbolic (GH) distribution are compared using the hessian stochastic order. This family includes the classes of symmetric and asymmetric distributions by which different behaviors of kurtosis in skewed and heavy tail data can be captured. By considering some closed convex cones and their duals, we derive some necessary and s...

متن کامل

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

متن کامل

SIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM

Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$  and  $A(G)$ the adjacency matrix of $G$. The  signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of  graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...

متن کامل

Transitive Closure of Innnite Graphs and Its Applications Transitive Closure of Innnite Graphs and Its Applications

Integer tuple relations can concisely summarize many types of information gathered from analysis of scientiic codes. For example they can be used to precisely describe which iterations of a statement are data dependent of which other iterations. It is generally not possible to represent these tuple relations by enumerating the related pairs of tuples. For example, it is impossible to enumerate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Match

سال: 2021

ISSN: ['0340-6253']

DOI: https://doi.org/10.46793/match.87-1.005l